Regularized nonmonotone submodular maximization
نویسندگان
چکیده
منابع مشابه
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
In this paper we consider the problem of maximizing any submodular function subject to d knapsack constraints, where d is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through extension by expectation of the submodular function. Formally, we show that, for any non-negative submodular function, an α-approximation algorithm f...
متن کاملNonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract)
Consider a situation in which one has a suboptimal solution S to a maximization problem which only constitutes a weak approximation to the problem. Suppose that even though the value of S is small compared to an optimal solution OPT to the problem, S happens to be structurally similar to OPT . A natural question to ask in this scenario is whether there is a way of improving the value of S based...
متن کاملSubmodular Welfare Maximization
We study different variants of the welfare maximization problem in combinatorial auctions. Assume there are n buyers interested in m items. Indeed they have different valuations on each item, i.e. buyer i has a valuation of wi(j) on item j. In the simplest model, a collection of items S worths ∑ j∈S wi(j) for buyer i; However, in practice, collection of items might have different values than th...
متن کاملSubmodular welfare maximization
We study different variants of the welfare maximization problem in combinatorial auctions. Assume there are n buyers interested in m items. Indeed they have different valuations on each item, i.e. buyer i has a valuation of wi(j) on item j. In the simplest model, a collection of items S worths ∑ j∈S wi(j) for buyer i; However, in practice, collection of items might have different values than th...
متن کاملSubmodular Function Maximization
Submodularity is a property of set functions with deep theoretical consequences and far– reaching applications. At first glance it appears very similar to concavity, in other ways it resembles convexity. It appears in a wide variety of applications: in Computer Science it has recently been identified and utilized in domains such as viral marketing (Kempe et al., 2003), information gathering (Kr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2023
ISSN: ['0974-0988']
DOI: https://doi.org/10.1080/02331934.2023.2173968